Virtual Shared Memory and Distributed Memory Implementations of Parallel Algorithms for Numerical Integration
نویسندگان
چکیده
Parallel globally adaptive algorithms for numerical integration provide a simple example of algorithms that exploit control parallelism. In this paper we consider the implementation of such algorithms on both virtual shared memory (KSR-1) and distributed memory (iPSC/860) machines and investigate how the characteristics of the diierent architectures aaect the choice of implementation and thereby the performances of the algorithms.
منابع مشابه
Distributed Shared Memory
This paper presents the overview of parallel computer models. Practical parallel machines which are parallel virtual machine (PVP), symmetric multiprocessor (SMP), massively parallel processor (MPP), distributed shared memory (DSM), and clusters of workstation (COWs) are described. According to the classification of practical parallel machines, this paper mainly deals with distributed shared me...
متن کاملCharacterizing Performance Issues in Shared-Memory Parallel Graph Benchmarks
Graph algorithms are well known as hard to parallelize, given their irregularity and poor locality. Yet basic characterization of the various factors that cause poor speedup in graph algorithms is lacking. This paper presents data and analysis that works towards characterizing the various components of poor speedup in shared memory OpenMP implementations of two graph benchmark programs, Graph50...
متن کاملSemiotics of Collective Memory of the Iran-Iraq War (Holy Defence): A Case Study of the Shared Images in Virtual Social Networks
This study aims to achieve a semiotic understanding of collective memory of the Iran-Iraq war. For this purpose, samples of images in virtual social networks shared in response to the news of discovery and return of the bodies of more than 175 divers have been analyzed. Visual signs in photographs, cartoons, graphic designs, prints, paintings and posters, in methods of historical pictures and f...
متن کاملConngurable Shared Virtual Memory for Parallel Computing
Most distributed-shared memory(DSM) systems use a global address space which is shared by all processing nodes. Although the global address space is convenient in providing a single address space for programming models, it is applicable to DSM systems with relatively small number of processing nodes. As the system size grows, there is a problem with scalability. To avoid this drawback, a new sh...
متن کاملParallel Distributed Implementations of 2D Explicit Euler Solvers
In this work we present a subdomain partitioning strategy applied to an explicit high-resolution Euler solver. We describe the design of a parallel multi-domain code suitable for distributed memory multi-processors. We present several implementations on a distributed virtual shared memory computer as well as on a network of workstations. We give computational results to illustrate the eeciency ...
متن کامل